A non-monotone Fast Marching scheme for a Hamilton-Jacobi equation modelling
نویسندگان
چکیده
In this paper we introduce an extension of the Fast Marching Method introduced by Sethian [6] for the eikonal equation modelling front evolutions in normal direction. The new scheme can deal with a time-dependent velocity without any restriction on its sign. This scheme is then used for solving dislocation dynamics problems in which the velocity of the front depends on the position of the front itself and its sign is not restricted to be positive or negative.
منابع مشابه
A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations
In this paper we present a generalization of the Fast Marching method introduced by J. A. Sethian in 1996 to solve numerically the eikonal equation. The new method, named Buffered Fast Marching (BFM), is based on a semi-Lagrangian discretization and is suitable for Hamilton-Jacobi equations modeling monotonically advancing fronts, including Hamilton-Jacobi-Bellman and Hamilton-JacobiIsaacs equa...
متن کاملConvergence of a non-monotone scheme for Hamilton-Jacobi-Bellman equations with discontinuous data
We prove the convergence of a non-monotonous scheme for a one-dimensional first order Hamilton-Jacobi-Bellman equation of the form vt+maxα(f(x, α)vx) = 0, v(0, x) = v0(x). The scheme is related to the HJB-UltraBee scheme suggested in [7]. We show for general discontinuous initial data a first-order convergence of the scheme, in L-norm, towards the viscosity solution. We also illustrate the non-...
متن کاملConvergence of a first order scheme for a non local eikonal equation ∗
We prove the convergence of a first order finite difference scheme approximating a non local eikonal Hamilton-Jacobi equation. The non local character of the problem makes the scheme not monotone in general. However, by using in a convenient manner the convergence result for monotone scheme of Crandall Lions, we obtain the same bound |∆X| + ∆t for the rate of convergence.
متن کاملLax – Friedrichs sweeping scheme for static Hamilton – Jacobi equations q
We propose a simple, fast sweeping method based on the Lax–Friedrichs monotone numerical Hamiltonian to approximate viscosity solutions of arbitrary static Hamilton–Jacobi equations in any number of spatial dimensions. By using the Lax–Friedrichs numerical Hamiltonian, we can easily obtain the solution at a specific grid point in terms of its neighbors, so that a Gauss–Seidel type nonlinear ite...
متن کاملFast Marching Methods for Stationary Hamilton-Jacobi Equations with Axis-Aligned Anisotropy
The fast marching method (FMM) has proved to be a very efficient algorithm for solving the isotropic Eikonal equation. Because it is a minor modification of Dijkstra’s algorithm for finding the shortest path through a discrete graph, FMM is also easy to implement. In this paper we describe a new class of Hamilton–Jacobi (HJ) PDEs with axis-aligned anisotropy which satisfy a causality condition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006